Weimann, Oren: search on Z-Library

The world's largest scientific articles store. 70,000,000+ articles for free.

Don't use scam websites

1

Reevaluating “The End of Mass Communication?”

Weimann, Gabriel, Weiss-Blatt, Nirit, Mengistu, Germaw, Tregerman, Maya Mazor, Oren, Ravid

Journal:

Mass Communication & Society

Year:

2014

Language:

english

File:

PDF, 324 KB

english, 2014

2

The Stackelberg Minimum Spanning Tree Game

Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann

Journal:

Year:

2011

Language:

english

File:

PDF, 430 KB

english, 2011

3

An optimal decomposition algorithm for tree edit distance

Demaine, Erik D., Mozes, Shay, Rossman, Benjamin, Weimann, Oren

Journal:

ACM Transactions on Algorithms

Year:

2009

Language:

english

File:

PDF, 647 KB

english, 2009

4

Approximating the Diameter of Planar Graphs in Near Linear Time

Weimann, Oren, Yuster, Raphael

Journal:

ACM Transactions on Algorithms

Year:

2015

Language:

english

File:

PDF, 268 KB

english, 2015

5

The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs

Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Ilan Newman, Oren Weimann

Journal:

Journal of Combinatorial Optimization

Year:

2013

Language:

english

File:

PDF, 917 KB

english, 2013

6

[ACM Press the 51st Annual ACM SIGACT Symposium - Phoenix, AZ, USA (2019.06.23-2019.06.26)] Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019 - Almost optimal distance oracles for planar graphs

Charalampopoulos, Panagiotis, Gawrychowski, Paweł, Mozes, Shay, Weimann, Oren

Year:

2019

File:

PDF, 1.70 MB

2019

7

A note on exact distance labeling

Oren Weimann, David Peleg

Journal:

Information Processing Letters

Year:

2011

Language:

english

File:

PDF, 109 KB

english, 2011

8

Towards optimal packed string matching

Ben-Kiki, Oren, Bille, Philip, Breslauer, Dany, Ga̧sieniec, Leszek, Grossi, Roberto, Weimann, Oren

Journal:

Theoretical Computer Science

Year:

2014

Language:

english

File:

PDF, 405 KB

english, 2014

9

Tree compression with top trees

Bille, Philip, Gørtz, Inge Li, Landau, Gad M., Weimann, Oren

Journal:

Information and Computation

Year:

2015

Language:

english

File:

PDF, 453 KB

english, 2015

10

Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions

Yury Lifshits, Shay Mozes, Oren Weimann, Michal Ziv-Ukelson

Journal:

Year:

2009

Language:

english

File:

PDF, 474 KB

english, 2009

11

[ACM Press the ACM Symposium - Washington, DC, USA (2017.07.25-2017.07.27)] Proceedings of the ACM Symposium on Principles of Distributed Computing - PODC '17 - Optimal Distance Labeling Schemes for Trees

Freedman, Ofer, Gawrychowski, Paweł, Nicholson, Patrick K., Weimann, Oren

Year:

2017

Language:

english

File:

PDF, 1.47 MB

english, 2017

12

Binary Jumbled Pattern Matching on Trees and Tree-Like Structures

Gagie, Travis, Hermelin, Danny, Landau, Gad M., Weimann, Oren

Journal:

Year:

2015

Language:

english

File:

PDF, 420 KB

english, 2015

13

Longest common extensions in trees

Bille, Philip, Gawrychowski, Paweł, Gørtz, Inge Li, Landau, Gad M., Weimann, Oren

Journal:

Theoretical Computer Science

Year:

2015

Language:

english

File:

PDF, 638 KB

english, 2015

14

Faster shortest paths in dense distance graphs, with applications

Mozes, Shay, Nussbaum, Yahav, Weimann, Oren

Journal:

Theoretical Computer Science

Year:

2017

Language:

english

File:

PDF, 1.51 MB

english, 2017

15

Fast algorithms for computing tree LCS

Shay Mozes, Dekel Tsur, Oren Weimann, Michal Ziv-Ukelson

Journal:

Theoretical Computer Science

Year:

2009

Language:

english

File:

PDF, 988 KB

english, 2009

16

Computing the Girth of a Planar Graph in $O(n \logn)$ Time

Weimann, Oren, Yuster, Raphael

Journal:

SIAM Journal on Discrete Mathematics

Year:

2010

Language:

english

File:

PDF, 502 KB

english, 2010

17

Shortest paths in directed planar graphs with negative lengths

Klein, Philip N., Mozes, Shay, Weimann, Oren

Journal:

ACM Transactions on Algorithms

Year:

2010

Language:

english

File:

PDF, 554 KB

english, 2010

18

Gene Proximity Analysis across Whole Genomes via PQ Trees 1

Landau, Gad M., Parida, Laxmi, Weimann, Oren

Journal:

Journal of Computational Biology

Year:

2005

Language:

english

File:

PDF, 194 KB

english, 2005

19

On Cartesian Trees and Range Minimum Queries

Erik D. Demaine, Gad M. Landau, Oren Weimann

Journal:

Year:

2014

Language:

english

File:

PDF, 562 KB

english, 2014

20

Replacement Paths and Distance Sensitivity Oracles via Fast Matrix Multiplication

Weimann, Oren, Yuster, Raphael

Journal:

ACM Transactions on Algorithms

Year:

2013

Language:

english

File:

PDF, 131 KB

english, 2013

21

The nearest colored node in a tree

Gawrychowski, Paweł, Landau, Gad M., Mozes, Shay, Weimann, Oren

Journal:

Theoretical Computer Science

Year:

2017

Language:

english

File:

PDF, 542 KB

english, 2017

22

Fast RNA structure alignment for crossing input structures

Rolf Backofen, Gad M. Landau, Mathias Möhl, Dekel Tsur, Oren Weimann

Journal:

Journal of Discrete Algorithms

Year:

2011

Language:

english

File:

PDF, 268 KB

english, 2011

23

Unified Compression-Based Acceleration of Edit-Distance Computation

Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann

Journal:

Year:

2013

Language:

english

File:

PDF, 599 KB

english, 2013

24

[IEEE 2010 IEEE 51st Annual Symposium on Foundations of Computer Science (FOCS) - Las Vegas, NV, USA (2010.10.23-2010.10.26)] 2010 IEEE 51st Annual Symposium on Foundations of Computer Science - Replacement Paths via Fast Matrix Multiplication

Weimann, Oren, Yuster, Raphael

Year:

2010

Language:

english

File:

PDF, 405 KB

english, 2010

25

Locality and Gaps in RNA Comparison

Backofen, Rolf, Chen, Shihyen, Hermelin, Danny, Landau, Gad M., Roytberg, Mikhail A., Weimann, Oren, Zhang, Kaizhong

Journal:

Journal of Computational Biology

Year:

2007

Language:

english

File:

PDF, 272 KB

english, 2007

26

Incremental distance products via faulty shortest paths

Weimann, Oren, Yuster, Raphael

Journal:

Information Processing Letters

Year:

2020

File:

PDF, 428 KB

2020

27

Approximating the maximum consecutive subsums of a sequence

Cicalese, Ferdinando, Laber, Eduardo, Weimann, Oren, Yuster, Raphael

Journal:

Theoretical Computer Science

Year:

2014

Language:

english

File:

PDF, 235 KB

english, 2014

28

Improved bounds for randomized preemptive online matching

Epstein, Leah, Levin, Asaf, Segev, Danny, Weimann, Oren

Journal:

Information and Computation

Year:

2017

Language:

english

File:

PDF, 593 KB

english, 2017

To build up a library is to create a life. It’s never just a random collection of books.

— Carlos María Domínguez

Official channel

Z-Library Desktop Launcher

Z-Library Since 2009 support@z-lib.do

EnglishРусскийEspañolItalianoελληνικάاللغة العربيةBahasa IndonesiaBahasa Malaysiaहिन्दीDeutschFrançaisPortuguêsУкраїнськаPolski中文繁體中文日本語Tiếng ViệtAzərbaycan DiliՀայոց լեզուภาษาไทยTürk Diliქართველიবাংলাپښتوతెలుగుاردو한국어SrpskiБългарски